Optimal Integer Delay-Budget Assignment on Directed Acyclic Graphs

Optimal Integer Delay Budgeting on Directed Acyclic Graphs

An excess delay each component of a design can tolerate under a given timing constraint, is referred to as a delay budget. Delay budgeting has been widely exploited to improve the design quality. We present an optimal integer delay budgeting algorithm. Due to numerical instability and discreteness of libraries of components during design optimization flow, integer solution for delay budgeting i...

Generic Directed Acyclic Graphs

Copula directed acyclic graphs

We present a new methodology for selecting a Bayesian network for continuous data outside the widely used class of multivariate normal distributions. The use of bivariate copula densities to model connections between pairs of nodes in the network brings in flexibility in the choice of the distribution. Cand D-vines play a central role in dealing with the high-dimensional aspect of the data, due...

Optimal Reduction of Two - Terminal Directed Acyclic Graphs * Wolfgang

Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex with unit in-degree (out-degree) into its sole incoming (outgoing) neighbor. This paper gives an O(n2"5) algorithm for minimizing node reductions, based on vertex cover in a transitive auxiliary graph. App...

Optimal Reductions of Two-Terminal Directed Acyclic Graphs

Algorithms for series-parallel graphs can be extended to arbitrary two-terminal dags if node reductions are used along with series and parallel reductions. A node reduction contracts a vertex with unit in-degree (out-degree) into its sole incoming (outgoing) neighbor. We give an O(n 2:5) algorithm for minimizing node reductions, based on vertex cover in a transitive auxiliary graph. Application...